Exclusive disjunctive soft sets
نویسندگان
چکیده
منابع مشابه
Disjunctive Stable Models : Unfounded Sets
Disjunctive logic programs have become a powerful tool in knowledge representation and commonsense reasoning. This paper focuses on stable model semantics, currently the most widely acknowledged semantics for disjunctive logic programs. After presenting a new notion of unfounded sets for disjunctive logic programs, we provide two declarative characterizations of stable models in terms of unfoun...
متن کاملSoft regular generalized b-closed sets in soft topological spaces
The main purpose of this paper is to introduce and study new classes of soft closed sets like soft regular generalized b-closed sets in soft topological spaces (briefly soft rgb-closed set) Moreover, soft rg-closed, soft gpr-closed, soft gb-closed, soft gsp-closed, soft g$alpha$-closed, soft g$alpha$b-closed, and soft sgb-closed sets in soft topological spaces are introduced in this paper and w...
متن کاملOn transitive soft sets over semihypergroups
The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $S_{H}$ and $T_{H},$ respectively. It is shown that $T_{H}=S_{H}$ if and only if $beta=beta^{*}.$ We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.
متن کاملAPPLICATIONS OF SOFT SETS IN HILBERT ALGEBRAS
The concept of soft sets, introduced by Molodtsov [20] is a mathematicaltool for dealing with uncertainties, that is free from the difficultiesthat have troubled the traditional theoretical approaches. In this paper, weapply the notion of the soft sets of Molodtsov to the theory of Hilbert algebras.The notion of soft Hilbert (abysmal and deductive) algebras, soft subalgebras,soft abysms and sof...
متن کاملThe Exclusive-or Disjunctive Information in Relational Databases
In this paper, we propose an extended relational model to accommodate exclusive-or disjunctive information. The proposed model is defined by first-order logic. The answers to a query contain both sure answers and maybe answers. To guarantee that the manipulation power of the proposed model is as good as that of the classical relational model, we prove that the classical properties of the databa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2010
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2009.12.018